Galois Theory with Infinitely Many Idempotents

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rings with Many Idempotents

We introduce a new stable range condition and investigate the structures of rings with many idempotents. These are also generalizations of corresponding results of J. Stock and H. P. Yu.

متن کامل

Equilibrium theory with asymmetric information and with infinitely many commodities

The traditional deterministic general equilibrium theory with infinitely many commodities cannot cover economies with private information constraints on the consumption sets. We bring the level of asymmetric information equilibrium theory at least at par with that of the deterministic. In particular, we establish results on equilibrium existence for exchange economies with asymmetric (different...

متن کامل

Infinitely ramified Galois representations

In this paper we show how to construct, for most p ≥ 5, two types of surjective representations ρ : GQ = Gal(Q̄/Q) → GL2(Zp) that are ramified at an infinite number of primes. The image of inertia at almost all of these primes will be torsion-free. The first construction is unconditional. The catch is that we cannot say whether ρ |Gp=Gal(Q̄p/Qp) is crystalline or even potentially semistable. The ...

متن کامل

Queues with infinitely many servers

— In the time interval (0, oo) calls arrive in a téléphone exchange in accordance with a récurrent process. There are an unlimited number ofavailable Unes. The holding times are mutually independent and identically distributed positive rondom variables and are independent of the arrivai times. In this paper we détermine the limit distribution of the number of the busy Unes at the arrivai of the...

متن کامل

Computing with Infinitely Many Processes

We explore four classic problems in concurrent computing (election, mutual exclusion, consensus, and naming) when the number of processes which may participate is infinite. Partial information about the number of actually participating processes and the concurrency level is shown to affect the possibility and complexity of solving these problems. We survey and generalize work carried out in mod...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nagoya Mathematical Journal

سال: 1969

ISSN: 0027-7630,2152-6842

DOI: 10.1017/s0027763000013039